A binary tree is made of nodes. Each node contains a "left" pointer, a "right" pointer. The "root" pointer points to the topmost node in the tree. The left and right pointers recursively point to smaller "subtrees". A null pointer represents an empty binary tree.
A binary tree is made of nodes. Each node contains a "left" pointer, a "right" pointer. The "root" pointer points to the topmost node in the tree. The left and right pointers recursively point to smaller "subtrees". A null pointer represents an empty binary tree.